Q: With what data structure can a priority queue be implemented?
A. Array
B. List
C. Heap
D. Tree
Solution: Priority queue can be implemented using an array, a list, a binary search tree or a heap, although the most efficient one being the heap.
Q: Which of the following is not an application of priority queue?
A. Huffman codes
B. Interrupt handling in operating system
C. Undo operation in text editors
D. Bayesian spam filter
Solution: Undo operation is achieved using a stack.
Q: Select the appropriate code that inserts elements into the list based on the given key value.
(head and trail are dummy nodes to mark the end and beginning of the list, they do not contain any priority or element)
D. public void insert_key(int key,Object item)
{
if(key<0)
{
Systerm.our.println("invalid");
System.exit(0);
}
else
{
Node temp = new Node(key,item,null);
if(count == 0)
{
head.setNext(temp);
temp.setNext(trail);
}
else
{
Node dup = head.getNext();
Node cur = head;
while((key>dup.getKey()) && (dup!=trail))
{
dup = cur
cur = cur.getNext();
}
cur.setNext(dup);
temp.setNext(cur);
}
count++;
}
}
Solution: Have two temporary pointers ‘dup’ and ‘cur’ with ‘cur’ trailing behind ‘dup’. Traverse through the list until the given key is greater than some element with a lesser key, insert the new node ‘temp’ in that position.
Q: What is the time complexity to insert a node based on key in a priority queue?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Solution: In the worst case, you might have to traverse the entire list.
Q: What is the functionality of the following piece of code?
public Object delete_key()
{
if(count == 0)
{
System.out.println("Q is empty");
System.exit(0);
}
else
{
Node cur = head.getNext();
Node dup = cur.getNext();
Object e = cur.getEle();
head.setNext(dup);
count--;
return e;
}
}
A. Delete the second element in the list
B. Return but not delete the second element in the list
C. Delete the first element in the list
D. Return but not delete the first element in the list
Solution: A pointer is made to point at the first element in the list and one more to point to the second element, pointer manipulations are done such that the first element is no longer being pointed by any other pointer, its value is returned.
Q: What is not a disadvantage of priority scheduling in operating systems?
A. A low priority process might have to wait indefinitely for the CPU
B. If the system crashes, the low priority systems may be lost permanently
C. Interrupt handling
D. Indefinite blocking
Solution: The lower priority process should wait until the CPU completes the processing higher priority process. Interrupt handling is an advantage as interrupts should be given more priority than tasks at hand so that interrupt can be serviced to produce desired results.
Q: Which of the following is not an advantage of a priority queue?
A. Easy to implement
B. Processes with different priority can be efficiently handled
C. Applications with differing requirements
D. Easy to delete elements in any case
Solution: In worst case, the entire queue has to be searched for the element having the highest priority. This will take more time than usual. So deletion of elements is not an advantage.
Q: What is the time complexity to insert a node based on position in a priority queue?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Solution: In the worst case, you might have to traverse the entire list.